#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>

using namespace std;

bool isPrimer(int n)
{
    if(n < 2)
    {
        return false;
    }
    for(int i = 2; i <= sqrt(n); ++i)
    {
        
        if( n % i == 0)
        {
            return false;
        }
    }

    return true;
}

int main()
{
    string str; cin >> str;
    unordered_map<char, int> counter;
    
    int maxn = INT_MIN;
    int minn = INT_MAX;

    for(auto ch : str)
        counter[ch]++;

    for(auto [ch,count] : counter)
    {
        maxn = max(maxn, count);
        minn = min(minn, count);
    }


    if(isPrimer(maxn - minn))
    {
        cout << "Lucky Word" << endl;
        cout << maxn - minn;
    }
    else 
    {
        cout << "No Answer" << endl;
        cout << 0;
    }

    return 0;
}

class Solution {
public:
    bool hostschedule(vector<vector<int> >& schedule) {
        sort(schedule.begin(), schedule.end());

        for(int i = 1; i < schedule.size(); ++i)
        {
            if(schedule[i][0] < schedule[i-1][1])
                return false;
        }

        return true;
    }
};